Towards a Weighted-Tree Similarity Algorithm for RNA Secondary Structure
نویسندگان
چکیده
A tree similarity algorithm for RNA (ribonucleic acid) secondary structure comparison is presented. The elements (nucleotides and nucleotide-pairs) of an RNA secondary structure are represented as normalized node-weighted trees. We show that our weighted tree representations of RNA secondary structures are informative and useful. Based on this unique representation for RNA secondary structure, we propose a weighted-tree similarity algorithm for computing the similarity between RNA secondary structures. The algorithm is justified by computing similarities among several well-known RNA secondary structures. For a given RNA secondary structure, the proposed algorithm provides a ranked list of RNA structures in a database according to their similarity values with the query RNA. Hence, our algorithm is helpful in predicting the functions and the class of a newly discovered RNA.
منابع مشابه
PreRkTAG: Prediction of RNA Knotted Structures Using Tree Adjoining Grammars
Background: RNA molecules play many important regulatory, catalytic and structural <span style="font-variant: normal; font-style: norma...
متن کاملComputing Similarity between Rna Strings 1
Ribonucleic acid (RNA) strings are strings over the four-letter alphabet fA; C; G; Ug with a secondary structure of base-pairing between A 0 U and C 0 G pairs in the string. Edges are drawn between two bases that are paired in the secondary structure and these edges have traditionally been assumed to be noncrossing. The noncrossing base-pairing naturally leads to a tree-like representation of t...
متن کاملComputing Similarity between RNA Strings
Ribonucleic acid (RNA) strings are strings over the four-letter alphabet {A, C, G, U} with a secondary structure of base-pairing between A U and C G pairs in the string 1 . Edges are drawn between two bases that are paired in the secondary structure and these edges have traditionally been assumed to be noncrossing. The noncrossing base-pairing naturally leads to a tree-like representation of th...
متن کاملSimilarity of Weighted Directed Acyclic Graphs
This thesis proposes a weighted DAG (wDAG) similarity algorithm for match-making in e-Business environments. We focus on the metadata representation of buyer and seller agents, as well as a similarity and associated simplicity measure over this information. In order to make the interaction between agents more meaningful and fine-grained, we choose node-labeled, arc-labeled and arc-weighted dire...
متن کامل\recent Methods for Rna Modeling Using Stochastic Context-free Grammars," Proc. Combinatorial Pattern
Ribonucleic acid (RNA) strings are strings over the four-letter alphabet fA;C;G;Ug with a secondary structure of base-pairing between A U and C G pairs in the string 1 . Edges are drawn between two bases that are paired in the secondary structure and these edges have traditionally been assumed to be noncrossing. The noncrossing base-pairing naturally leads to a tree-like representation of the s...
متن کامل